Adolescents show collective intelligence which can be driven by a geometric mean rule of thumb

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Does Diarrhoea Causes Cataract? Can Cataract be Prevented by Aspirin?

Loss of transparency of the lens is termed cataract which is one of the commonest causes of blindness throughout the world. This major health problem appears to be much commoner in many developing countries such as India and Pakistan, where it causes visual disability at a substantially earlier age and several hypotheses have been put forward to explain this higher prevalence in these areas. Re...

متن کامل

Which demand systems can be generated by discrete choice?

We provide a simple necessary and suffi cient condition for when a multiproduct demand system can be generated from a discrete choice model with unit demands.

متن کامل

Rule learning by Habituation can be Simulated in Neural Networks

Contrary to a recent claim that neural network models are unable to account for data on infant habituation to artificial language sentences, the present simulations show successful coverage with cascade-correlation networks using analog encoding. The results demonstrate that a symbolic rule-based account is not required by the infant data. One of the fundamental issues of cognitive science cont...

متن کامل

Can Bayes' Rule Be Justified by Cognitive Rationality Principles

The justification of Bayes' rule by cognitive rationality principles is undertaken by extending the propositional axiom systems usually proposed in two contexts of belief change: revising and updating. Probabilistic belief change axioms are introduced, either by direct transcription of the set-theoretic ones, or in a stronger way nevertheless in the spirit of the underlying propositional princi...

متن کامل

Which Dynamic Constraint Problems Can Be Solved By Ants?

There exist a number of algorithms that can solve dynamic constraint satisfaction/optimization problems (DynCSPs or DynCOPs). Because of the large variety in the characteristics of DynCSPs and DynCOPs, not all algorithms perform equally well on all problems. In this paper, we present the Dynamic Constraint Optimization Ant Algorithm (DynCOAA). It is based upon the ant colony optimization (ACO) ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: PLOS ONE

سال: 2018

ISSN: 1932-6203

DOI: 10.1371/journal.pone.0204462